On a class of quadratic programming problem with equality constraints 一类带有等式约束的二次规划问题
Fixed iterative method for solving the inequality constrained quadratic programming problem 不等式约束二次规划的不动点迭代
An interior point algorithm for convex quadratic programming problem with box constraints 框式约束凸二次规划问题的内点算法
A global convergence inner - point style algorithm for generic quadratic programming problem 二次规划问题的一个全局收敛的内点型算法
Training svm can be formulated into a quadratic programming problem . for large learning tasks with many training examples , off - the - shelf optimization techniques quickly become intractable in their memory and time requirements . thus , many efficient techniques have been developed 训练svm的本质是解决一个二次规划问题,在实际应用中,如果用于训练的样本数很大,标准的二次型优化技术就很难应用。